probabilistically checkable proofs造句
例句与造句
- See probabilistically checkable proofs for more details.
- Locally testable codes have a lot in common with probabilistically checkable proofs ( PCPs ).
- In a probabilistically checkable proof system, a proof is represented as a sequence of bits.
- His two most-cited papers are on multi-prover interactive proofs and on probabilistically checkable proofs.
- The PCP theorem is the culmination of a long line of work on interactive proofs and probabilistically checkable proofs.
- It's difficult to find probabilistically checkable proofs in a sentence. 用probabilistically checkable proofs造句挺难的
- Another interactive proof system characterizing "'NEXPTIME "'is a certain class of probabilistically checkable proofs.
- Probabilistically checkable proofs give rise to many complexity classes depending on the number of queries required and the amount of randomness used.
- The definition of a probabilistically checkable proof was explicitly introduced by Arora and Safra in 1992, although their properties were studied earlier.
- These results are sometimes also called PCP theorems because they can be viewed as probabilistically checkable proofs for NP with some additional structure.
- His research area is theoretical computer science, focusing on randomness, cryptography, probabilistically checkable proofs, approximation, property testing, and sublinear algorithms.
- The theory of hardness of approximation requires a detailed understanding of the role of completeness, soundness, alphabet size, and query complexity in probabilistically checkable proofs.
- He also received an honorable mention in the ACM doctoral dissertation award in 2003 for his dissertation, " New Techniques for Probabilistically Checkable Proofs and Inapproximability Results ."
- Sudan has made important contributions to several areas of theoretical computer science, including probabilistically checkable proofs, non-approximability of list decoding, and error-correcting codes.
- The rough idea of these inapproximability results is to form a graph that represents a probabilistically checkable proof system for an NP-complete problem such as the Boolean satisfiability problem.
- However, what makes them interesting is the existence of probabilistically checkable proofs that can be checked by reading only a few bits of the proof using randomness in an essential way.
更多例句： 下一页
